On Separation Criterion and Recovery Algorithm for Chain Graphs

نویسنده

  • Milan Studený
چکیده

Chain graphs {CGs) give a natural unifying point of view on Markov and Bayesian net­ works and enlarge the potential of graphi­ cal models for description of conditional in­ dependence structures. In the paper a di­ rect graphical separation criterion for CGs which generalizes the d-separation criteri­ on for Bayesian networks is introduced (re­ called). It is equivalent to the classic mo _ r­ alization criterion for CGs and complete m the sense that for every CG there exists a probability distribution satisfying exactly in­ dependencies derivable from the CG by the separation criterion. Every class of Markov e­ quivalent CGs can be uniquely described by a natural representative, called the largest CG. A recovery algorithm, which on basis of the (conditional) dependency model given by a CG finds the corresponding largest CG, is p­

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separation and Completeness Properties for Amp Chain Graph Markov Models

Pearl’s well-known d-separation criterion for an acylic directed graph (ADG) is a pathwise separation criterion that can be used to efficiently identify all valid conditional independence relations in the Markov model determined by the graph. This paper introduces p-separation, a pathwise separation criterion that efficiently identifies all valid conditional independences under the Andersson-Ma...

متن کامل

Markov Properties for Acyclic Directed Mixed Graphs

We consider acyclic directed mixed graphs, in which directed edges (x → y) and bi-directed edges (x ↔ y) may occur. A simple extension of Pearl’s d-separation criterion, called m-separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m-separation criterion.

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Bayesian Networks from the Point of View of Chain Graphs

The paper gives a few arguments in favour of use of chain graphs for description of proba­ bilistic conditional independence structures. Every Bayesian network model can be equiva­ lently introduced by means of a factorization formula with respect to chain graph which is Markov equivalent to the Bayesian network. A graphical characterization of such graphs is given. The class of equivalent grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996